Sthread: In-Vivo Model Checking of Multithreaded Programs
نویسندگان
چکیده
منابع مشابه
Model Checking Multithreaded Programs by Means of Reduced Models
Java is largely used to develop distributed and concurrent systems, but testing multithreaded systems cannot guarantee the quality of the software; in contrast, verification techniques give us a higher confidence about the system and, among these, model checking methods automatically establish properties of complex systems. Such techniques are usually applied to specification languages, and sev...
متن کاملModel Checking Multithreaded Programs with Asynchronous Atomic Methods
In order to make multithreaded programming manageable, programmers often follow a design principle where they break the problem into tasks which are then solved asynchronously and concurrently on different threads. This paper investigates the problem of model checking programs that follow this idiom. We present a programming language SPL that encapsulates this design pattern. SPL extends simpli...
متن کاملLinear-Time Model-Checking for Multithreaded Programs under Scope-Bounding
We address the model checking problem of omega-regular linear-time properties for shared memory concurrent programs modeled as multi-pushdown systems. We consider here boolean programs with a finite number of threads and recursive procedures. It is well-known that the model checking problem is undecidable for this class of programs. In this paper, we investigate the decidability and the complex...
متن کاملRuntime Model Checking of Multithreaded C Programs using Automated Instrumentation Dynamic Partial Order Reduction and Distributed Checking
Conventional testing methods are inadequate for debugging multithreaded C programs because many “unexpected” thread interactions can only be manifested through very low probability event sequences that are easily missed during test creation. As a result, bugs can escape into the field, and often manifest years after code deployment [1]. While the approach of building formal models in modeling l...
متن کاملModel Checking Procedural Programs
We consider the model-checking problem for sequential programs with procedure calls. We first present basic algorithms for solving the reachability problem and the fair computation problem. The algorithms are based on two techniques: summarization, that computes reachability information by solving a set of fixpoint equations, and saturation, that computes the set of all reachable program states...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Art, Science, and Engineering of Programming
سال: 2020
ISSN: 2473-7321
DOI: 10.22152/programming-journal.org/2020/4/13